A note on arbitrarily complex recursive functions.
نویسندگان
چکیده
منابع مشابه
A Note on Recursive Functions
In this paper, we propose a new and elegant deenition of the class of recursive functions, analogous to Kleene's deenition but diiering in the primitives taken, thus demonstrating the computational power of the concurrent programming language in-The deenition can be immediately rephrased for any distributive graph in a count-ably extensive category with products, thus allowing a wide, natural g...
متن کاملA Note on Recursively Enumerable Classes of Partial Recursive Functions
A class F of partial recursive functions is called recursively enumerable if there exists an r.e. set J ⊆ N such that F = {φi | i ∈ J}. We prove that every r.e. class F of partial recursive functions with infinite domains must have a recursive witness array, i.e. there is a computable array of finite sets X = [Xn]n∈ω such that (i) for every f ∈ F one has f(n) ∈ Xn for infinitely many n and (ii)...
متن کاملA note on arbitrarily vertex decomposable graphs
A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n1, ..., nk) of positive integers such that n1 + ... + nk = n there exists a partition (V1, ..., Vk) of the vertex set of G such that for each i ∈ {1, ..., k}, Vi induces a connected subgraph of G on ni vertices. In this paper we show that if G is a two-connected graph on n vertices with the independence nu...
متن کاملA note on recursive optimization
This paper presents a new and efficient approach for optimization and implementation of filter banks e.g. velocity channels, orientation channels and scale spaces. The multi layered structure of a filter network enable a powerful decomposition of complex filters into simple filter components and the intermediary results may contribute to several output nodes. Compared to a direct implementation...
متن کاملA note on recursive multiple-priors
One of the assumptions of recursive multiple-priors utility (Epstein and Schneider, J. Econ. Theory, 113(1) (2003), 1-31) is that conditional preferences at every node satisfy an intertemporal version of the multiple-priors axioms (Gilboa and Schmeidler, J. Math. Econ., 18(2) (1989) 141-153). This note weakens this assumption: Given that conditional preferences depend only on the continuations ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1988
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093637869